import java.util.Arrays;

public class L62 {

    public static void main(String[] args) {
        int i = new Solution().uniquePaths(3, 7);
        System.out.println(i);
    }


    static class Solution {
        public int uniquePaths(int m, int n) {

            int[][] dp = new int[m][n];
            for (int[] ints : dp) {
                Arrays.fill(ints, 1);
            }

            for (int i = 1; i < m; i++) {
                for (int j = 1; j < n; j++) {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                    System.out.println("====================");
                    for (int[] ints : dp) {
                        System.out.println(Arrays.toString(ints));
                    }
                }
            }

            return dp[m - 1][n - 1];
        }
    }
}
